Sum rules for effective resistances in infinite graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Sum Rules at Infinite Momentum

By combining the qO-im method for asymptotic sum rules with the P-CQ method of Fubini and Furlan, we relate the structure functions W2 and WI in inelastic lepton-nucleon scattering to matrix elements of commutators of currents at almost-equal times at infinite momentum. We argue that the infinite momentum limit for these commutators does not diverge but may vanish. If the limit is nonvanishing ...

متن کامل

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs

We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that contain small balanced separators. We give a fully dynamic algorithm that maintains (1 + ε)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with Õ( √ n/ε) worst-case update time and Õ( √ n...

متن کامل

Light-cone sum rules in soft-collinear effective theory

We derive light-cone sum rules (LCSRs) for exclusive B-meson decays into light energetic hadrons from correlation functions within soft-collinear effective theory (SCET). In these sum rules the short-distance scale refers to “hard-collinear” interactions with virtualities of order ΛQCDmb. Hard scales (related to virtualities of order mb) are integrated out and enter via external coefficient fun...

متن کامل

An effective heuristic algorithm for sum coloring of graphs

Given an undirected graph G = (V,E), the minimum sum coloring problem (MSCP) is to find a legal vertex coloring of G, using colors represented by natural numbers (1, 2, . . .) such that the total sum of the colors assigned to the vertices is minimized. In this paper, we present EXSCOL, a heuristic algorithm based on independent set extraction for this NP-hard problem. EXSCOL identifies iterativ...

متن کامل

On electric resistances for distance-regular graphs

We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper, [12]. Our main result, Theorem 4 below, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency. A number of auxiliary results are als...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2017

ISSN: 1742-5468

DOI: 10.1088/1742-5468/aa6503